Codd's Self-Replicating Computer
نویسنده
چکیده
Edgar Codd's 1968 design for a self-replicating cellular automaton has never been implemented. Partly this is due to its enormous size, but we have also identified four problems with the original specification that would prevent it from working. These problems potentially cast doubt on Codd's central assertion, that the eight-state space he presents supports the existence of machines that can act as universal constructors and computers. However, all these problems were found to be correctable, and we present a complete and functioning implementation after making minor changes to the design and transition table. The body of the final machine occupies an area that is 22,254 cells wide and 55,601 cells high, composed of over 45 million nonzero cells in its unsheathed form. The data tape is 208 million cells long, and self-replication is estimated to take at least 1.7 x 10(18) time steps.
منابع مشابه
Self-replicating Cellular Automata
Abstract In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are performed by storing a dedicated program (sequence of states) on self-replicating loops, and letting the loops retrieve the operands, exchange data among themselves, and perform the calculations according to a se...
متن کاملThe evolution of self-replicating computer organisms
A computer model is described that explores some of the possible behavior of biological life during the early stages of evolution. The simulation starts with a primordial soup composed of randomly generated sequences of computer operations selected from a basis set of 16 opcodes. With a probability of about 10 -4, these sequences spontaneously generate large and inefficient self-replicating "or...
متن کاملRobotic Self-replication in Structured and Adaptable Environments
Since the first theoretical work on self-replicating machines was performed by John Von Neumann [1], his ideas have been applied in many research areas such as cellular automata, nanotechnology, macromolecular chemistry and computer viruses [2]. Penrose, in [3], presented simple units with certain properties able to self-replicate. Although his work could not make the further step toward self-r...
متن کاملSelf-Replicating Expressions in the Lambda Calculus
The study of self-replicating structures in Computer Science has been taking place for more than half a century, motivated by the desire to understand the fundamental principles and algorithms involved in self-replication. The bulk of the literature explores self-replicating forms in Cellular Automata. Though trivially self-replicating programs have been written for dozens of languages, very li...
متن کاملExternally Controllable and Destructible Self-Replicating Loops
Self-replicating loops presented to date are essentially worlds unto themselves, inaccessible to the observer once the replication process is launched. In this paper we present a self-replicating loop which allows for user interaction. Specifically, the user can control the loop’s replication and induce its destruction. After presenting the design of this novel loop, we delineate its physical i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artificial life
دوره 16 2 شماره
صفحات -
تاریخ انتشار 2010